Processing Complex Similarity Queries: A Systematic Approach
نویسندگان
چکیده
In this paper we introduce a set of operations for complex manipulation with approximate queries represented by scoring functions. We show correspondence of these operations to the user expectations and applications needs. We evaluate the effectiveness of our techniques in the context of content-based image retrieval task and compare it to the known fusion methods.
منابع مشابه
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similarity queries are defined through a generic language L and whose predicates refer to a single feature F . Contrary to the language level which deals only with similarity scores, the proposed evaluation process is based ...
متن کاملEfficiently Supporting Multiple Similarity Queries for Mining in Metric Databases
Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases, similarity queries in the form of range queries or k-nearest neighbor queries are the most important queries. In traditional query processing, single queries are issued independently by different users. In many data mining applications, however, the database is typically ...
متن کاملEfficient and effective similarity search on complex objects
Due to the rapid development of computer technology and new methods for the extraction of data in the last few years, more and more applications of databases have emerged, for which an efficient and effective similarity search is of great importance. Application areas of similarity search include multimedia, computer aided engineering, marketing, image processing and many more. Special interest...
متن کاملEvaluation of a Layered Approach to Question Answering over Linked Data
We present a question answering system architecture which processes natural language questions in a pipeline consisting of five steps: i) question parsing and query template generation, ii) lookup in an inverted index, iii) string similarity computation, iv) lookup in a lexical database in order to find synonyms, and v) semantic similarity computation. These steps are ordered with respect to th...
متن کاملMultiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases
Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases, similarity queries in the form of range queries or k-nearest neighbor queries are the most important query types. In traditional query processing, single queries are issued independently by different users. In many data mining applications, however, the database is typica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011